Necessary Conditions for Interpolation by Multivariate Polynomials

نویسندگان

چکیده

Abstract Let $$\Omega $$ Ω be a smooth, bounded, convex domain in $${\mathbb {R}}^n$$ R n and let $$\Lambda _k$$ Λ k finite subset of . We find necessary geometric conditions for to interpolating the space multivariate polynomials degree at most k Our results are asymptotic The density obtained match precisely that sampling sets known satisfy expressed terms equilibrium potential set. Moreover we prove particular case unit ball, large enough, there no bases orthogonal reproducing kernels

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conditions for interpolation of stable polynomials

This contribution addresses the problem of the interpolation of a set of positive numbers by stable real polynomials. It is shown that the interpolant preserves local positivity, monotonicity, and convexity in order to satisfy stability requirement of the interpolating polynomial. Then this issue is formulated as a nonlinear system carrying on the existence of negative real roots and positive r...

متن کامل

Multivariate Interpolation by Polynomials and Radial Basis Functions

In many cases, multivariate interpolation by smooth radial basis functions converges towards polynomial interpolants, when the basis functions are scaled to become “wide”. In particular, examples show that interpolation by scaled Gaussians seems to converge towards the de Boor/Ron “least” polynomial interpolant. The paper starts by providing sufficient criteria for the convergence of radial int...

متن کامل

A new algorithm for sparse interpolation of multivariate polynomials

To reconstruct a black box multivariate sparse polynomial from its floating point evaluations, the existing algorithms need to know upper bounds for both the number of terms in the polynomial and the partial degree in each of the variables. Here we present a new technique, based on Rutishauser’s qd-algorithm, inwhichwe overcome both drawbacks. © 2008 Elsevier B.V. All rights reserved.

متن کامل

On sign conditions over real multivariate polynomials

We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a family of real polynomials defining regular hypersurfaces that intersect transversally. This enables us to show a probabilistic procedure to list all feasible sign conditions. We extend our main algorithm to the case of an...

متن کامل

Some Necessary Conditions for Schur Stability of Polynomials

This paper concerns the Schur stability of polynomials. Firstly necessary conditions are presented for the Schur stability of complex polynomials with fixed coefficients based on the discrete Hermite-Biehler theorem. Then the result is applied to obtain necessary conditions for the robust Schur stability of real interval polynomials.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Methods and Function Theory

سال: 2021

ISSN: ['2195-3724', '1617-9447']

DOI: https://doi.org/10.1007/s40315-021-00410-8